Identifying  unknown parameter and name value pairs

ABSTRACT

Identifying parameter and name/value pair separators within two or more strings of data. The identifying is performed by selecting at least one name/value pair separator candidate from the two or more strings of data, and filtering the at least one name/value pair separator candidate using one or more rules, thereby removing any of the name/value pair separator candidates that do not conform to any of the one or more rules. The identifying additionally includes selecting at least one parameter separator candidate from the two or more strings of data, and filtering the at least one parameter separator candidate using one or more rules, thereby removing any of the at least one parameter separator candidates that do not conform to any of the one or more rules. The result is a set of tuples that includes a name/value separator candidate, and a parameter separator candidate.

BACKGROUND

This invention relates generally to processing within a computingenvironment, and more particularly to identifying unknown parameter andname value pairs.

The advent of asynchronous JavaScript and XML (Ajax) and rich Internetapplications has transformed the way information is exchanged between abrowser and a web server. Before Ajax the most common way to sendinformation to a web application was via a form submittal, today thereare an infinite number of combinations of parameter formats and datatransfer standards.

For example before the introduction of Ajax, to make a login page, thedeveloper would use a form which would contain at least two inputfields: a user name and a password and a submit button.

<form action=“login.jsp” method=“POST”> <input type=“text”name=“user”/></br> <input type=“password” name=“pass”/></br> <inputtype=“submit” value=“Submit”/></br> </form

When the submit button is clicked the browser transforms this form andthe information populated by the user within it, into a HTTP requestwhich would transmit the parameters as“uid=jsmith&passw=Demo1234&btnSubmit=Login.” These parameters weredelimited using standard characters “=” for name and value separators,and “&” for parameter separators.

After Ajax was introduced the requirement to use an actual web form waseliminated because JavaScript within the page is able to manipulate andsubmit HTTP requests. In addition, both the HTML itself and the HTTPrequest being sent to the server have changed. Using, for example,JavaScript Object Notation (JSON) formatted JavaScript submission withthe same parameters will be transmitted as“[“uid”:“jsmith”,“pass”:“Demo1234”]” over an XMLHTTPRequest JavaScriptfunction.

The use of JSON is not required, and therefore developers are free totransmit data in any format using the XMLHTTPRequest JavaScriptfunction. Since the format of parameters is now left to the ingenuity ofthe JavaScript developers various variations of parameter configurationsare possible. Another example is the use of XML to parameterize datasuch as “<uid>jsmith</uid><pass>Demo1234</pass>.” Any other character orset of characters may be used to separate parameters, and name/valuepairs from one another.

BRIEF SUMMARY

Additional features and advantages are realized through the techniquesof the present invention. Other embodiments and aspects of the inventionare described in detail herein and are considered a part of the claimedinvention. For a better understanding of the invention with advantagesand features, refer to the description and to the drawings.

An embodiment of the invention includes a method for identifyingparameter and name/value pair separators. The method includes receivingtwo or more strings of data, wherein each of the two or more strings ofdata include at least one separator. The method additionally includesselecting at least one name/value pair separator candidate from the twoor more strings of data. The method further includes filtering the atleast one name/value pair separator candidate using one or more rules,thereby removing any of the name/value pair separator candidates that donot conform to any of the one or more rules. The method additionallyincludes selecting at least one parameter separator candidate from thetwo or more strings of data, and filtering the at least one parameterseparator candidate using one or more rules. The filtering removing anyof the at least one parameter separator candidates that do not conformto any of the one or more rules. The method further includes creating aset of tuples, wherein each tuple in the set of tuples includes aname/value separator candidate, and a parameter separator candidate.

An additional embodiment includes a system for identifying parameter andname/value pair separators. The system receives two or more strings ofdata, wherein each of the two or more strings of data include at leastone separator. The system further selects at least one name/value pairseparator candidate from the two or more strings of data, and filtersthe at least one name/value pair separator candidate using one or morerules, thereby removing any of the name/value pair separator candidatesthat do not conform to any of the one or more rules. The systemadditionally selects at least one parameter separator candidate from thetwo or more strings of data, and filters the at least one parameterseparator candidate using one or more rules. The filtering removing anyof the at least one parameter separator candidates that do not conformto any of the one or more rules. The system additionally creates a setof tuples, wherein each tuple in the set of tuples includes a name/valueseparator candidate, and a parameter separator candidate.

A further embodiment includes a computer program product for identifyingparameter and name/value pair separators. The computer program productperforms a method that includes receiving two or more strings of data,wherein each of the two or more strings of data include at least oneseparator. The method additionally includes selecting at least onename/value pair separator candidate from the two or more strings ofdata. The method further includes filtering the at least one name/valuepair separator candidate using one or more rules, thereby removing anyof the name/value pair separator candidates that do not conform to anyof the one or more rules. The method additionally includes selecting atleast one parameter separator candidate from the two or more strings ofdata, and filtering the at least one parameter separator candidate usingone or more rules. The filtering removing any of the at least oneparameter separator candidates that do not conform to any of the one ormore rules. The method further includes creating a set of tuples,wherein each tuple in the set of tuples includes a name/value separatorcandidate, and a parameter separator candidate.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

Referring now to the drawings wherein like elements are numbered alikein the several FIGURES:

FIG. 1 depicts a schematic diagram of a system for identifying unknownparameter name value pairs that may be implemented by an embodiment;

FIG. 2 depicts a process flow for determining the name/value pairseparators candidates for a set of text strings in an embodiment; and

FIGS. 3A-3B depict a process flow for determining the name/value pairseparator, and parameter separator set candidates for a set of textstrings in an embodiment.

DETAILED DESCRIPTION

An embodiment of the present invention provides a system, method andcomputer program product for identifying unknown parameter name valuepairs.

In an embodiment, text is received that includes a number of webcomponents with unknown name/value pair, and parameter separators. Theweb components are compared to one another using a text comparisonalgorithm, and a set of potential name/value pair separators isidentified based on a series of rules. Once the set of potentialname/value pair separators is identified, they are used to identifyparameter separators using the text comparison algorithm, and anotherset of rules. Potential name/value separators that are not consistentwith the rules are eliminated, and one or more sets of name/value andparameter tuples are selected as potential separators.

The variety of parameter formats introduced by Ajax introduces achallenge for web application security testing, and complicates testingand web application development. A web security scanner may beimplemented to test vulnerabilities in web applications. A web securityscanner has a predefined list of known parameter formats sometimesidentified by name value and parameter separator pairs. If a Web Scannerencounters an Ajax request that uses an unknown parameter format it willbe unable to correctly test that request for security issues.

An example of security test that needs to be executed is authenticationbypass using SQL Injection. SQL injection is an attempt by someonetrying to access secure data on in a web application by shapingparameters such that they include SQL query components that fool the webapplication into returning data that is not intended to be returned on aparticular page. For a web security scanner to properly test for SQLinjection vulnerabilities it must know the format for name/value pairsincluding the name/value pair separator and the parameter separator.Missing such vulnerabilities may be extremely costly for a company, andtherefore a solution to automatically identify the parameter format isbeneficial in modern complex web applications.

Although the aspects of the invention have been described as implementedin a web security scanner, it will be understood that aspects of theinvention may be implemented in any situation in which theidentification of separators in data is required, includingimplementations beyond web based data transmissions.

Turning now to FIG. 1, a system 100 for identifying unknown parameterand name value pairs will now be described. In an embodiment, the system100 includes a host system computer 102 executing computer instructionsfor identifying unknown parameter and name value pairs. Host systemcomputer 102 may operate in any type of environment that is capable ofexecuting a software application. Host system computer 102 may comprisea high-speed computer processing device, such as a mainframe computer,to manage the volume of operations governed by an entity for which theunknown parameter and name value pairs identification is executing. Inan embodiment, the host system computer 102 is part of an enterprise(e.g., a commercial business) that implements a identifying unknownparameter and name value pairs system.

In an embodiment, the system 100 depicted in FIG. 1 includes one or moreclient systems 104 through which users at one or more geographiclocations may contact the host system computer 102. The client systems104 are coupled to the host system computer 102 via one or more networks106. Each client system 104 may be implemented using a general-purposecomputer executing a computer program for carrying out the processesdescribed herein. The client systems 104 may be personal computers(e.g., a lap top, a personal digital assistant, a mobile device) or hostattached terminals. If the client systems 104 are personal computers,the processing described herein may be shared by a client system 104 andthe host system computer 102 (e.g., by providing an applet to the clientsystem 104). Client systems 104 may be operated by authorized users(e.g., programmers) of the unknown parameter and name value pairsidentification system described herein.

The networks 106 may be any type of known network including, but notlimited to, a wide area network (WAN), a local area network (LAN), aglobal network (e.g., Internet), a virtual private network (VPN), and anintranet. The networks 106 may be implemented using a wireless networkor any kind of physical network implementation known in the art. Aclient system 104 may be coupled to the host system computer 102 throughmultiple networks (e.g., intranet and Internet) so that not all clientsystems 104 are coupled to the host system computer 102 through the samenetwork. One or more of the client systems 104 and the host systemcomputer 102 may be connected to the networks 106 in a wireless fashion.In one embodiment, the networks 106 include an intranet and one or moreclient systems 104 executing a user interface application (e.g., a webbrowser) to contact the host system computer 102 through the networks106. In another embodiment, the client system 104 is connected directly(i.e., not through the networks 106) to the host system computer 102 andthe host system computer 102 contains memory for storing data in supportof identifying unknown parameter and name value pairs. Alternatively, aseparate storage device (e.g., storage device 112) may be implementedfor this purpose.

In an embodiment, the storage device 112 includes a data repository withdata relating to the identification of unknown parameter and name valuepairs by the system 100, as well as other data/information desired bythe entity representing the host system computer 102 of FIG. 1. Thestorage device 112 is logically addressable as a consolidated datasource across a distributed environment that includes networks 106.Information stored in the storage device 112 may be retrieved andmanipulated via the host system computer 102 and/or the client systems104. In an embodiment, the storage device 112 includes one or moredatabases containing, e.g., and corresponding configuration parameters,values, methods, and properties, as well as other related information aswill be discussed more fully below. It will be understood by those ofordinary skill in the art that the storage device 112 may also compriseother structures, such as an XML file on the file system or distributedover a network (e.g., one of networks 106), or from a data stream fromanother server located on a network 106. In addition, all or a portionof the storage device 112 may alternatively be located on a clientsystem 104.

The host system computer 102 depicted in the system of FIG. 1 may beimplemented using one or more servers operating in response to acomputer program stored in a storage medium accessible by the server.The host system computer 102 may operate as a network server (e.g., aweb server) to communicate with the client systems 104. The host systemcomputer 102 handles sending and receiving information to and from theclient systems 104 and can perform associated tasks. The host systemcomputer 102 may also include a firewall to prevent unauthorized accessto the host system computer 102 and enforce any limitations onauthorized access. For instance, an administrator may have access to theentire system and have authority to modify portions of the system. Afirewall may be implemented using conventional hardware and/or softwareas is known in the art.

The host system computer 102 may also operate as an application server.The host system computer 102 executes one or more computer programs toprovide the identification of unknown parameter and name value pairs.The host system computer 102 includes a separator identification module108 for identifying unknown parameter and name value pairs. As indicatedabove, processing may be shared by the client systems 104 and the hostsystem computer 102 by providing an application (e.g., java applet) tothe client systems 104. Alternatively, the client system 104 can includea stand-alone software application for performing a portion or all ofthe processing described herein. As previously described, it isunderstood that separate servers may be utilized to implement thenetwork server functions and the application server functions.Alternatively, the network server, the firewall, and the applicationserver may be implemented by a single server executing computer programsto perform the requisite functions.

It will be understood that the system for identifying of unknownparameter and name value pairs described in FIG. 1 may be implemented inhardware, software executing on a general purpose computer, or acombination thereof.

FIG. 2 depicts a process flow for determining the name/value pairseparator candidates for a set of text strings in an embodiment. Theprocess flow of FIG. 2 may be implemented in, for example, the separatoridentification module 108 of FIG. 1. At block 202, two or more decodedweb components are received. In an embodiment, the decoded webcomponents are strings of characters that have been stripped of anycontrol information and that contain at least one name/value pair and aseparator. In an embodiment, the web components are query stringsstripped from a web query, or post data strings as is known in the art.At block 204, a set C of decoded web components are selected. The set ofC components may be all or a subset of the received decoded webcomponents.

At block 204, the first two of the web components from set C areselected and are compared using a text difference algorithm. In anembodiment, a largest common sequence difference algorithm is used,however any algorithm suitable for identifying sets of characters commonto two strings may be used. At block 208, common elements identified inthe two compared web components are added to a common element set (CE).At block 210, it is determined if all of the web components from the setC have been processed. If not all of the web components from the set Chave been processed, then processing continues at block 224, where theelements in the CE set are compared against the next uncompared elementin C. Processing then continues at block 208. Otherwise, if all of theweb components in C have been processed processing continues at block212. At block 212, an empty list of name/value separators is created.

At block 214, it is determined if all of the elements in the CE set havebeen processed. If there are additional elements in the CE set, thenprocessing continues at block 216. At block 216, the next element in theCE set is selected for processing at block 218. At block 218, it isdetermined if the selected element includes letters within it.Separators generally do not contain letters and numbers because it wouldrequire that the separators be further delimited or escaped in order forthem to be distinguished from the names and values that they delimit. Ifthe selected element does not contain letters or numbers, thenprocessing continues at block 220. At block 220, it is determined if theelement is at the beginning of the string of data in the web component.A name/value pair delimiter is unlikely to occur at the beginning of thestring of name/value pairs. If the element does not occur at thebeginning of the web component then processing continues at block 222.At block 222, the element is added to the name/value separator setcreated at block 212 and processing continues at block 214.

Returning to block 220, if the element is at the beginning of the webcomponent, then the element is discarded and processing continues atblock 214. Returning to block 218, if the element includes letters ornumbers, then the element is discarded and processing continues at block214. Returning to block 214, if all of the CE elements have beenprocessed, then at block 224 the name/value set for the web componentsis returned as candidate name/value pair separators.

FIGS. 3A-3B depict a process flow for determining the name/value pairseparator, and parameter separator set candidates for a set of textstrings in an embodiment. The process flow of FIGS. 3A-3B may beimplemented in, for example, the separator identification module 108 ofFIG. 1. At block 302, a name/value pair separator candidate is selectedfrom the candidate name/value pair separator set created in FIG. 2above. At block 304, a new set C^(nv) is created from the set of webcomponents that include the name/value pair separator at least twice. Atblock 306, it is determined if the set C^(nv) includes at least twocomponents. If there are at least two components in the set C^(nv) thenprocessing continues at block 308. At block 308, the first twocomponents in the set C^(nv) are compared using a difference algorithmas described above with regard to FIG. 2. At block 310, common elementsidentified in the two compared components are added to a common elementset CE and processing continues at block 312. At block 312, it isdetermined if all of the components in the set C^(nv) have beenprocessed. If not all of the components in the set C^(nv) have beenprocessed, then processing continues at block 310.

Otherwise processing continues at block 316 of FIG. 3B. At block 316, itis determined if all of the elements in the set C^(nv) have beenprocessed. If not all of the elements in the set C^(nv) have beenprocessed, then processing continues at block 318. At block 318, anelement p is selected from the set C^(nv). At block 320, it isdetermined if the element p is equal to any of the name/value separatorcandidates identified previously. It is unlikely that a parameterseparator would be the same as the name/value pair separator. Therefore,if there is a match, then p is discarded and processing continues atblock 316. Otherwise processing continues at block 322. At block 322 itis determined if the element p includes letters or numbers. As statedabove, it is unlikely that a separator would include letters or numbers,therefore, if the element p includes letters or numbers, then it isdiscarded and processing continues at block 316.

Otherwise processing continues at block 324. At block 324, it isdetermined if p is at the beginning of any of the web components. Asstated above, it is unlikely that a separator will appear at thebeginning of a web component, therefore, if the element p is found atthe beginning of any of the web components, then the element p isdiscarded and processing continues at block 316. Otherwise processingcontinues at block 326. At block 326, it is determined if any of thepotential name/value pair candidates occur more often than the element poccurs in the web component +1. Typically, since each name value pair isseparated from each other name value pairs by at least one parameterseparator, if the name/value pair separator occurs n times, then pshould occur at least n-1 times. Therefore of the name/value pairseparator candidate occurs more often then the p separator occurs +1then the p element is discarded, and processing continues at block 316.

Otherwise, processing continues at block 328. At block 328, it isdetermined if two name/value pair separator candidates appearconsecutively without the element p between them. If two name/valuepairs appear together without the element p between them, then p is notlikely to be a parameter separator, because parameter separators, bydefinition, separate each of the name/value pairs from one another.Therefore, if there are two name/value pair candidates that are notseparated by the element p, then processing continues at block 316.Otherwise processing continues at block 330. At block 330, thename/value separator candidate, and the selected p are added as a tupleto a possible separator pair set and processing continues at block 316.

Returning to block 316, if all of the elements CE^(nv) have beenprocessed, then processing continues at block 332 of FIG. 3A. At block332, the set of possible separator pairs is reviewed, and any pairs thatare contained in other pairs are excluded from the list. At block 334,the remaining possible separator pair tuples are saved and processingcontinues at block 338. At block 338, it is determined if all of thename/value pair separator candidates have been processed. If not all ofthe name/value pair candidates have been processed, then processingcontinues at block 302, where the next name value pair is selected.Otherwise, if all of the name/value pair candidates have been processed,then the name/value pair and separator tuples are returned as separatorcandidates at block 340.

Returning to block 306, if the set C^(nv) includes at less than twocomponents, then processing continues at block 338. At block 338, theparameter separator p is set to empty. At block 336, the name/value paircandidate and the empty parameter separator tuple is saved as apotential candidate and processing continues at block 332.

In an embodiment, the separator candidates are used to by a web securityscanner to test a web application.

Technical effects and benefits include determining name/value pair andparameter separators using an automated method without requiringknowledge of what the separator values are. An additional benefitincludes the generation of a set of name/value and parameter separatortuples that may be used to verify and test data in a web application.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present invention has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the invention. Theembodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described above with reference toflowchart illustrations and/or schematic diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

As described above, embodiments can be embodied in the form of computer-implemented processes and apparatuses for practicing those processes. Inembodiments, the invention is embodied in computer program code executedby one or more network elements. Embodiments include a computer programproduct on a computer usable medium with computer program code logiccontaining instructions embodied in tangible media as an article ofmanufacture. Exemplary articles of manufacture for computer usablemedium may include floppy diskettes, CD-ROMs, hard drives, universalserial bus (USB) flash drives, or any other computer-readable storagemedium, wherein, when the computer program code logic is loaded into andexecuted by a computer, the computer becomes an apparatus for practicingthe invention. Embodiments include computer program code logic, forexample, whether stored in a storage medium, loaded into and/or executedby a computer, or transmitted over some transmission medium, such asover electrical wiring or cabling, through fiber optics, or viaelectromagnetic radiation, wherein, when the computer program code logicis loaded into and executed by a computer, the computer becomes anapparatus for practicing the invention. When implemented on ageneral-purpose microprocessor, the computer program code logic segmentsconfigure the microprocessor to create specific logic circuits.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

What is claimed is:
 1. A computer implemented method, comprising:receiving, on a computer, two or more strings of data, each of the twoor more strings of data including at least one separator; selecting, onthe computer, at least one name/value pair separator candidate from thetwo or more strings of data; filtering, on the computer, the at leastone name/value pair separator candidate using one or more rules, thefiltering removing any of the at least one name/value pair separatorcandidates that do not conform to any of the one or more rules;selecting, on the computer, at least one parameter separator candidatefrom the two or more strings of data; filtering, on the computer, the atleast one parameter separator candidate using one or more rules, thefiltering removing any of the at least one parameter separatorcandidates that do not conform to any of the one or more rules; andcreating, on the computer, a set of tuples, each tuple in the set oftuples comprising a name/value separator candidate, and a parameterseparator candidate.
 2. The method of claim 1, wherein the two or morestrings of data are character strings of data containing one or moreunknown separators, and the two or more strings of data are datasubmitted to a web application over a network connection.
 3. The methodof claim 1, wherein the selecting comprises using a difference algorithmto identify one or more characters in common between each of the two ormore strings of data.
 4. The method of claim 1, wherein the one or morerules for filtering the at least one name/value pair separator candidateand the at least one parameter separator candidate comprises determiningif the any of the at least one name/value pair separator candidates orthe at least one parameter separator candidate is one of a letter, and anumber.
 5. The method of claim 1, wherein the one or more rules forfiltering the at least one name/value pair separator candidate and theat least one parameter separator candidate comprises determining if anyof the at least one name/value pair separator candidates or any of theat least one parameter separator candidates is at the beginning of thetwo or more strings of data.
 6. The method of claim 1, wherein the oneor more rules for filtering the at least parameter separator candidatescomprises determining if any of the at least one parameter separatorcandidates is equal to any of the at least one name/value pair separatorcandidates.
 7. The method of claim 1, wherein the one or more rules forfiltering the at least parameter separator candidates comprisesdetermining if any of the at least one parameter separator candidatesoccurs in any of the two or more strings of data more often than anumber of occurrences of any of the at least one name/value pairseparator candidates −1.
 8. The method of claim 1, wherein the one ormore rules for filtering the at least parameter separator candidatescomprises determining if two or more of the at least one name/value pairseparator candidates occurs before any of the at least one parameterseparator candidates.
 9. A system comprising: a processor configured toexecute a separator identification module, the processor configured to:receive two or more strings of data, each of the two or more strings ofdata including at least one separator; select at least one name/valuepair separator candidate from the two or more strings of data; filterthe at least one name/value pair separator candidate using one or morerules, the filtering removing any of the at least one name/value pairseparator candidates that do not conform to any of the one or morerules; select at least one parameter separator candidate from the two ormore strings of data; filter the at least one parameter separatorcandidate using one or more rules, the filtering removing any of the atleast one parameter separator candidates that do not conform to any ofthe one or more rules; and create a set of tuples, each tuple in the setof tuples comprising a name/value separator candidate, and a parameterseparator candidate.
 10. The system of claim 9, wherein the two or morestrings of data are character strings of data containing one or moreunknown separators, and the two or more strings of data are datasubmitted to a web application over a network connection.
 11. The systemof claim 9, wherein the selecting comprises using a difference algorithmto identify one or more characters in common between each of the two ormore strings of data.
 12. The system of claim 9, wherein the one or morerules for filtering the at least one name/value pair separator candidateand the at least one parameter separator candidate comprises determiningif the any of the at least one name/value pair separator candidates orthe at least one parameter separator candidate is one of a letter, and anumber.
 13. The system of claim 9, wherein the one or more rules forfiltering the at least one name/value pair separator candidate and theat least one parameter separator candidate comprises determining if anyof the at least one name/value pair separator candidates or any of theat least one parameter separator candidates is at the beginning of thetwo or more strings of data.
 14. The system of claim 9, wherein the oneor more rules for filtering the at least parameter separator candidatescomprises determining if any of the at least one parameter separatorcandidates is equal to any of the at least one name/value pair separatorcandidates.
 15. The system of claim 9, wherein the one or more rules forfiltering the at least parameter separator candidates comprisesdetermining if any of the at least one parameter separator candidatesoccurs in any of the two or more strings of data more often than anumber of occurrences of any of the at least one name/value pairseparator candidates −1.
 16. The system of claim 9, wherein the one ormore rules for filtering the at least parameter separator candidatescomprises determining if two or more of the at least one name/value pairseparator candidates occurs before any of the at least one parameterseparator candidates.
 17. A computer program product comprising: atangible storage medium readable by a processing circuit and storinginstructions for execution by the processing circuit for performing amethod comprising: receiving two or more strings of data, each of thetwo or more strings of data including at least one separator; selecting,on the computer, at least one name/value pair separator candidate fromthe two or more strings of data; filtering the at least one name/valuepair separator candidate using one or more rules, the filtering removingany of the at least one name/value pair separator candidates that do notconform to any of the one or more rules; selecting at least oneparameter separator candidate from the two or more strings of data;filtering the at least one parameter separator candidate using one ormore rules, the filtering removing any of the at least one parameterseparator candidates that do not conform to any of the one or morerules; and creating a set of tuples, each tuple in the set of tuplescomprising a name/value separator candidate, and a parameter separatorcandidate.
 18. The computer program product of claim 17, wherein the twoor more strings of data are character strings of data containing one ormore unknown separators, and the two or more strings of data are datasubmitted to a web application over a network connection.
 19. Thecomputer program product of claim 17, wherein the selecting comprisesusing a difference algorithm to identify one or more characters incommon between each of the two or more strings of data.
 20. The computerprogram product of claim 17, wherein the one or more rules for filteringthe at least one name/value pair separator candidate and the at leastone parameter separator candidate comprises determining if the any ofthe at least one name/value pair separator candidates or the at leastone parameter separator candidate is one of a letter, and a number. 21.The computer program product of claim 17, wherein the one or more rulesfor filtering the at least one name/value pair separator candidate andthe at least one parameter separator candidate comprises determining ifany of the at least one name/value pair separator candidates or any ofthe at least one parameter separator candidates is at the beginning ofthe two or more strings of data.
 22. The computer program product ofclaim 17, wherein the one or more rules for filtering the at leastparameter separator candidates comprises determining if any of the atleast one parameter separator candidates is equal to any of the at leastone name/value pair separator candidates.
 23. The computer programproduct of claim 17, wherein the one or more rules for filtering the atleast parameter separator candidates comprises determining if any of theat least one parameter separator candidates occurs in any of the two ormore strings of data more often than a number of occurrences of any ofthe at least one name/value pair separator candidates −1.
 24. Thecomputer program product of claim 17, wherein the one or more rules forfiltering the at least parameter separator candidates comprisesdetermining if two or more of the at least one name/value pair separatorcandidates occurs before any of the at least one parameter separatorcandidates.